Fast and Accurate Evaluation of Memory Performance Upper Bound

In many cases compiler based optimizations for memory performance tuning are too limited and programmers have to resort to manual optimization techniques However this process is tedious and time consuming especially since there is no indication on when the process can stop i e when optimal memory performance has been achieved or su ciently approached Architecture simulators can provide such information but designing an accurate model of an existing architecture is very di cult and simulation times are excessively long In this article we propose a technique that is both fast and reasonably accurate for estimating the memory performance upper bound of many scienti c applications This technique has been tested on several programs and can be used to guide a manual optimization process or even to drive iterative compilation techniques